Abstract state machines: verification problems and complexity
نویسنده
چکیده
State Machines: Verification Problems and Complexity Von der Fakultät für Mathematik, Informatik und Naturwissenschaften der Rheinisch-Westfälischen Technischen Hochschule Aachen zur Erlangung des akademischen Grades eines Doktors der Naturwissenschaften genehmigte Dissertation vorgelegt von Diplom-Informatiker Marc Spielmann aus Duisburg Referent: Universitätsprofessor Dr. E. Grädel Koreferent: Universitätsprofessor Dr. J. Van den Bussche Tag der mündlichen Prüfung: 21. Juni 2000
منابع مشابه
Abstract State Machines: Verification Problems and Complexity Dissertation
State Machines: Verification Problems and Complexity
متن کاملAbstract state machines: verification problems and computational power
State Machines: Verification Problems and Computational Power Von der Fakultät für Mathematik, Informatik und Naturwissenschaften der Rheinisch-Westfälischen Technischen Hochschule Aachen zur Erlangung des akademischen Grades einer Doktorin der Naturwissenschaften genehmigte Dissertation
متن کاملEnabling SystemC Verification using Abstract State Machines
SystemC is a system level language recently proposed to raise the abstraction level for embedded systems design and verification. We propose a verification methodology for SystemC designs based on a combination of static code analysis and SystemC semantics described with abstract state machines (ASM). We abstract the source SystemC design into hypergraphs to keep an abstract (simplified) view o...
متن کاملThe Linear Time Hierarchy Theorems for Abstract State Machines and RAMs
We prove the Linear Time Hierarchy Theorems for random access machines and Gurevich abstract state machines. One long-term goal of this line or research is to prove lower bounds for natural linear time problems.
متن کاملModel Checking Parameterized Asynchronous Shared-Memory Systems
We characterize the complexity of liveness verification for parameterized systems consisting of a leader process and arbitrarily many anonymous and identical contributor processes. Processes communicate through a shared, bounded-value register. While each operation on the register is atomic, there is no synchronization primitive to execute a sequence of operations atomically. We analyze the cas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000